Satisfaction Guaranteed
نویسندگان
چکیده
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially useful in an interactive context in which different users access the model to make choices on-line, e.g. in e-commerce configuration. The conventional machinery for ensuring backtrack-free search, however, adds additional constraints, which may require an impractical amount of space. A new approach is presented here that achieves a backtrack-free representation by removing values. This may limit the choice of solutions, but we are guaranteed not to eliminate them all. Experimental experience suggests that the trade-off for users between processing effort and solution loss may be worthwhile.
منابع مشابه
Feasible parallel-update distributed MPC for uncertain linear systems sharing convex constraints
A distributed MPC approach for linear uncertain systems sharing convex constraints is presented. The systems, which are dynamically decoupled but share constraints on state and/or inputs, optimize once, in parallel, at each time step and exchange plans with neighbours thereafter. Coupled constraint satisfaction is guaranteed, despite the simultaneous decision making, by extra constraint tighten...
متن کاملGuaranteed non-linear estimation using constraint propagation on sets
In the nonlinear case, the situation is much less developed and there are very few methods that produce such guaranteed estimates. In this paper, the discrete-time problem is cast into the more general framework of constraint satisfaction problems. Algorithms rather classical in the area of interval constraint propagation are extended by replacing intervals by more general subsets of real vecto...
متن کاملADMIT: a toolbox for guaranteed model invalidation, estimation and qualitative–quantitative modeling
SUMMARY Often competing hypotheses for biochemical networks exist in the form of different mathematical models with unknown parameters. Considering available experimental data, it is then desired to reject model hypotheses that are inconsistent with the data, or to estimate the unknown parameters. However, these tasks are complicated because experimental data are typically sparse, uncertain, an...
متن کاملOn-Line, Reflexive Constraint Satisfaction for Hybrid Systems: First Steps
We can achieve guaranteed constraint satisfaction of a hybrid dynamical system (which takes into account the underlying continuous dynamics) in a simple, hierarchical control algorithm. Two layers of functionality, (1) piece-wise viable servo controllers and (2) a “reflex controller,” are required for guaranteed constraint satisfaction. The resulting control structure allows higher-levels of “i...
متن کاملInformation Hiding and the Complexity of Constraint Satisfaction
This paper discusses the complexity of constraint satisfaction, and the eeect of information hiding. On the one hand, powerful constraint satisfaction is necessarily global, and tends to break information hiding. On the other hand, preserving strict information hiding increases the complexity of constraint satisfaction, or severely limits the power of the constraint solver. Ultimately, under st...
متن کامل